An Efficient Slime Mould Algorithm Combined With K-Nearest Neighbor for Medical Classification Tasks
نویسندگان
چکیده
Growing science and medical technologies have produced a massive amount of knowledge on different scales biological systems. By processing various amounts data, these will increase the quality disease detection enhance usability health information The integration machine learning in computer-based diagnostic systems facilitates early diseases, enabling more productive treatments prolonged survival rates. slime mould algorithm (SMA) may drawbacks, such as being trapped minimal local regions having an unbalanced exploitation exploration phase. To overcome limitations, this paper proposes ISMA, improved version hybridized with opposition-based (OBL) strategy based k-nearest neighbor (kNN) classifier for classification approach. Opposition-based improves global exploratory ability while avoiding premature convergence. experimental results revealed superiority proposed ISMA–kNN evaluation metrics, including accuracy, sensitivity, specificity, precision, F-score, G-mean, computational time, feature selection (FS) size compared tunicate swarm (TSA), marine predators (MPA), chimp optimization (ChOA), moth–flame (MFO) algorithm, whale (WOA), sine cosine (SCA), original SMA algorithm. Performance tests were run same maximum number function evaluations (FEs) nine UCI benchmark data sets sizes.
منابع مشابه
An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn efficient instance selection algorithm for k nearest neighbor regression
The k-Nearest Neighbor algorithm(kNN) is an algorithm that is very simple to understand for classification or regression. It is also a lazy algorithm that does not use the training data points to do any generalization, in other words, it keeps all the training data during the testing phase. Thus, the population size becomes a major concern for kNN, since large population size may result in slow...
متن کاملAn Enhancement of k-Nearest Neighbor Classification Using Genetic Algorithm
K-Nearest Neighbor Classification (kNNC) makes the classification by getting votes of the k-Nearest Neighbors. Performance of kNNC is depended largely upon the efficient selection of k-Nearest Neighbors. All the attributes describing an instance does not have same importance in selecting the nearest neighbors. In real world, influence of the different attributes on the classification keeps on c...
متن کاملAn Improved k-Nearest Neighbor Classification Using Genetic Algorithm
k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different data sets. The traditional KNN text classification algorithm has three limitations: (i) calculation complexity due to the usage of all the training samples for classification, (ii) the perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3105485